Efficient Algorithms for Zeckendorf Arithmetic
نویسندگان
چکیده
We study the problem of addition and subtraction using the Zeckendorf representation of integers. We show that both operations can be performed in linear time; in fact they can be performed by combinational logic networks with linear size and logarithmic depth. The implications of these results for multiplication, division and square-root extraction are also discussed.
منابع مشابه
The Zeckendorf Expansion of Polynomial Sequences
In the first part of the paper we prove that the Zeckendorf sum-ofdigits function sZ(n) and similarly defined functions evaluated on polynomial sequences of positive integers or primes satisfy a central limit theorem. We also prove that the Zeckendorf expansion and the q-ary expansions of integers are asymptotically independent.
متن کاملGeneralizations of the Dual Zeckendorf Integer Representation Theorems—discovery by Fibonacci Trees and Word Patterns
In this paper we show how the two well-known integer representation theorems which are associated with the name of Zeckendorf may be generalized as dual systems by constructing colored tree sequences whose shade sets partition Z = {1, 2, . . . } . Many interesting properties of the representations can be observed directly from the tree diagrams, and the proofs of the properties can truly be sai...
متن کاملA Constant Optimization of the Binary Indexed Tree Query Operation
There are several data structures which can calculate the prefix sums of an array efficiently, while handling point updates on the array, such as Segment Trees and Binary Indexed Trees (BIT). Both these data structures can handle the these two operations (query and update) in O(log n) time. In this paper, we present a data structure similar to the BIT, but with an even smaller constant. To do t...
متن کاملEfficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS
Residue Number System is a numerical system which arithmetic operations are performed parallelly. One of the main factors that affects the system’s performance is the complexity of reverse converter. It should be noted that the complexity of this part should not affect the earned speed of parallelly performed arithmetic unit. Therefore in this paper a high speed converter for moduli set {2n-1, ...
متن کاملEfficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS
Residue Number System is a numerical system which arithmetic operations are performed parallelly. One of the main factors that affects the system’s performance is the complexity of reverse converter. It should be noted that the complexity of this part should not affect the earned speed of parallelly performed arithmetic unit. Therefore in this paper a high speed converter for moduli set {2n-1, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1207.4497 شماره
صفحات -
تاریخ انتشار 2012